Lossless Secret Image Sharing Schemes

نویسندگان

  • V. P. Binu
  • A. Sreekumar
چکیده

Secret image sharing deals with splitting confidential images into several shares and the original image can be reconstructed from the qualified subset of the shares. Secret sharing schemes are used in transmission and storage of private medical images and military secrets. Increased confidentiality and availability are the major achievements. We propose an efficient (2, 2) scheme and (2, 3) scheme for secret image sharing. The scheme is lossless and also the share size is same as the secret size. The sharing and revealing phase uses simple modular arithmetic which can be very easily implemented. Experimental results on Binary and Gray scale images show that the proposed scheme is secure and efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meaningful Shadows for Image Secret Sharing with Steganography and Authentication Techniques

In this paper, we proposed a lossless secret sharing scheme using a steganography technique to improve the performances of Lin and Tsai’s as well as Yang et al.’s schemes. To ensure the reconstructed image is the true secret image, an authentication mechanism is imported into the proposed scheme to verify whether all the shadows are validated before reconstructing the secret image. In compariso...

متن کامل

Simple and Efficient Secret Sharing Schemes for Sharing Data and Image

Secret sharing is a new alternative for outsourcing data in a secure way. It avoids the need for time consuming encryption decryption process and also the complexity involved in key management. The data must also be protected from untrusted cloud service providers. Secret sharing based solution provides secure information dispersal by making shares of the original data and distributes them amon...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

Improving Contrast in Random Grids Based Visual Secret Sharing

In the existing random grids based (n, n) visual secret sharing (VSS) schemes, decryption is done with the help of human visual system by stacking the cipher grids. The stacking operation is computationally modeled as Boolean OR operation, which suffers from two drawbacks. Firstly, the contrast of the reconstructed image decreases exponentially by increasing n (≥2) and secondly, it requires per...

متن کامل

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1501.02892  شماره 

صفحات  -

تاریخ انتشار 2015